Mixed Over-Voltage Decomposition Using Atomic Decompositions Based on a Damped Sinusoids Atom Dictionary

نویسندگان

  • Qing Yang
  • Jing Wang
  • Wenxia Sima
  • Lin Chen
  • Tao Yuan
چکیده

The main purpose of this paper is to establish a signal decomposition system aiming at mixed over-voltages in power systems. In an electric power system, over-voltage presents a great threat for the system safety. Analysis and identification of over-voltages is helpful to improve the stability and safety of power systems. Through statistical analysis of a collection of field over-voltage records, it was found that a kind of complicated signals created by mixing of multiple different over-voltages is difficult to identify correctly with current classification algorithms. In order to improve the classification and identification accuracy of over-voltages, a mixed over-voltage decomposition system based on the atomic decomposition and a damped sinusoid atom dictionary has been established. This decomposition system is optimized by using particle swarm optimization and the fast Fourier transform. Aiming at possible fault decomposition results during decomposition of the over-voltage signal, a double-atom decomposition algorithm is proposed in this paper. By taking three typical mixed over-voltages as examples, the validity of the algorithm is demonstrated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Goodwin & Vetterli : Matching Pursuit and Atomic Signal Models

The matching pursuit algorithm can be used to derive signal decompositions in terms of the elements of a dictionary of time-frequency atoms. Using a structured overcomplete dictionary yields a signal model that is both parametric and signal-adaptive. In this paper, we apply matching pursuit to the derivation of signal expansions based on damped sinusoids. It is shown that expansions in terms of...

متن کامل

Matching pursuit with damped sinusoids

The matching pursuit algorithm derives an expansion of a signal in terms of the elements of a large dictionary of time-frequency atoms. This paper considers the use of matching pursuit for computing signal expansions in terms of damped sinusoids. First, expansion based on complex damped sinusoids is explored; it is shown that the expansion can be e ciently derived using the FFT and simple recur...

متن کامل

Sparse Components of Images and Optimal Atomic Decompositions

Recently, Field, Lewicki, Olshausen, and Sejnowski have reported efforts to identify the “Sparse Components” of image data. Their empirical findings indicate that such components have elongated shapes and assume a wide range of positions, orientations, and scales. To date, Sparse Components Analysis (SCA) has only been conducted on databases of small (e.g. 16-by-16) image patches and there seem...

متن کامل

Internship report Inria Bordeaux - Team GEOSTAT

Matching pursuit (MP), particularly using the Gammatones dictionary, has become a popular tool in sparse representations of speech/audio signals. The classical MP algorithm does not however take into account psychoacoustical aspects of the auditory system. Recently two algorithms, called PAMP and PMP have been introduced in order to select only perceptually relevant atoms during MP decompositio...

متن کامل

Uncertainty principles and ideal atomic decomposition

Suppose a discrete-time signal ( ), 0 , is a superposition of atoms taken from a combined time–frequency dictionary made of spike sequences 1 = and sinusoids exp 2 ) . Can one recover, from knowledge of alone, the precise collection of atoms going to make up ? Because every discrete-time signal can be represented as a superposition of spikes alone, or as a superposition of sinusoids alone, ther...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011